ME-ASP: A Multi-Engine Solver for Answer Set Programming
نویسندگان
چکیده
In this paper we present ME-ASP, a new multi-engine solver for Answer Set Programming (ASP). ME-ASP relies on machine learning techniques for inductively determining its algorithm selection strategy for choosing the ”most promising” ASP solver among the ones available. We describe the architecture of ME-ASP and the classification methods it supports. An experimental analysis, performed on benchmarks from the 3rd ASP competition, shows how ME-ASP performs with the various methods, and outlines that ME-ASP can have very robust performance.
منابع مشابه
Multi-engine ASP solving with policy adaptation
The recent application of Machine Learning techniques to the Answer Set Programming (ASP) field proved to be effective. In particular, the multi-engine ASP solver me-asp is efficient: it is able to solve more instances than any other ASP system that participated to the 3rd ASP Competition on the “System Track” benchmarks. In the me-asp approach, classification methods inductively learn off-line...
متن کاملThe Multi-engine ASP Solver ME-ASP: Progress Report
ME-ASP is a multi-engine solver for ground ASP programs. It exploits algorithm selection techniques based on classification to select one among a set of out-of-the-box heterogeneous ASP solvers used as black-box engines. In this paper we report on (i) a new optimized implementation of MEASP; and (ii) an attempt of applying algorithm selection to non-ground programs. An experimental analysis rep...
متن کاملA multi-engine approach to answer-set programming
Answer Set Programming (ASP) is a truly-declarative programming paradigm proposed in the area of non-monotonic reasoning and logic programming, that has been recently employed in many applications. The development of efficient ASP systems is, thus, crucial. Having in mind the task of improving the solving methods for ASP, there are two usual ways to reach this goal: (i) extending state-of-the-a...
متن کاملThe Multi-Engine ASP Solver me-asp
In this paper we describe the new system ME-ASP, which applies machine learning techniques for inductively choosing, among a set of available ones, the “best” ASP solver on a per-instance basis. Moreover, we report the results of some experiments, carried out on benchmarks from the “System Track” of the 3rd ASP Competition, showing the state-of-the-art performance of our solver.
متن کاملThe AC(C) Language: Integrating Answer Set Programming and Constraint Logic Programming
Combining Answer Set Programming (ASP) and Constraint Logic Programming (CLP) can create a more powerful language for knowledge representation and reasoning. The language AC(C) is designed to integrate ASP and CLP. Compared with existing integration of ASP and CSP, AC(C) allows representing user-defined constraints. Such integration provides great power for applications requiring logical reason...
متن کامل